package WEEK_191;

import java.util.Arrays;
import java.util.LinkedList;
import java.util.List;

import LCommon.TreeMethod;
import LCommon.TreeNode;

public class Test {

	public static void main(String[] args) {
		int[] numshorizontalCuts = { 1, 2, 4 };
		int[] verticalCuts = { 1, 3 };

		int res = new Solution().maxArea(1, 2, numshorizontalCuts, verticalCuts);
		System.out.println(res);

//		int[][] connections = { { 0, 1 }, { 1, 3 }, { 2, 3 }, { 4, 0 }, { 4, 5 } };
//
//		int res = new Solution().minReorder(6, connections);
//		System.out.println(res);
	}

}
